Hyperrelations in version space
نویسندگان
چکیده
منابع مشابه
Lattice Machine: Version Space in Hyperrelations
A version space is a set of all hypotheses consistent with a given set of training examples, delimited by the specific boundary and the general boundary. In existing studies [4, 5, 3] a hypothesis is a conjunction of attribute-value pairs, which is shown to have limited expressive power [6]. In this paper we investigate version space in a more expressive hypothesis space, where a hypothesis is ...
متن کاملGeneralized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space trees allow for a comfortable representation of version spaces and a natural way to efficiently process inductive queries and operations on version spaces. In particular, we focus on using generalized version space tree...
متن کاملThe Iterated Version Space Learning
Inspired with Version Space learning the Iterated Version Space Algorithm IVSA has been designed and implemented to learn disjunctive concepts IVSA dynamically partitions its search space of potential hypotheses of the target concept into contour shaped regions until all training instances are maximally correctly classi ed
متن کاملThe Iterated Version Space Algorithm
We present the Iterated Version Space Al gorithm IVSA which retains many advan tages of the Version Space Algorithm while handling disjunctive concepts and noise IVSA repeatedly generates hypotheses for regions of the concept space and combines these regional hypotheses to produce an overall concept hypothesis Experiments were conducted to learn English pronunci ation rules from word pronunciat...
متن کاملThe Structure of Version Space
We investigate the generalisation performance of consistent classi-ers, i.e. classiiers that are contained in the so-called version space, both from a theoretical and experimental angle. In contrast to classical VC analysis | where no single classiier within version space is singled out on grounds of a generalisation error bound | the data dependent structural risk minimisation framework sugges...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2004
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2003.10.007